Hyperelliptic Curves with Compact Parameters
نویسندگان
چکیده
We present a family of hyperelliptic curves whose Jacobians are suitable for cryptographic use, and whose parameters can be specified in a highly efficient way. This is done via complex multiplication and identity-based parameters. We also present some novel computational shortcuts for these families.
منابع مشابه
Generating More Kawazoe-Takahashi Genus 2 Pairing-Friendly Hyperelliptic Curves
Constructing pairing-friendly hyperelliptic curves with small ρ-values is one of challenges for practicability of pairing-friendly hyperelliptic curves. In this paper, we describe a method that extends the Kawazoe-Takahashi method of generating families of genus 2 ordinary pairing-friendly hyperelliptic curves by parameterizing the parameters as polynomials. With this approach we construct genu...
متن کاملHyperelliptic curves, L-polynomials and random matrices
We analyze the distribution of unitarized L-polynomials L̄p(T ) (as p varies) obtained from a hyperelliptic curve of genus g ≤ 3 defined over Q. In the generic case, we find experimental agreement with a predicted correspondence (based on the Katz-Sarnak random matrix model) between the distributions of L̄p(T ) and of characteristic polynomials of random matrices in the compact Lie group USp(2g)....
متن کاملA pr 2 00 9 Abel maps for curves of compact type
Recently, the first Abel map for a stable curve of genus g ≥ 2 has been constructed. Fix an integer d ≥ 1 and let C be a stable curve of compact type of genus g ≥ 2. We construct two d-th Abel maps for C, having different targets, and we compare the fibers of the two maps. As an application, we get a characterization of hyperelliptic stable curves of compact type with two components via the 2-n...
متن کاملSoftware Implementation of Genus-2 Hyperelliptic Curve Cryptosystems Over Prime Fields
This paper describes the system parameters and software implementation of a HECDSA cryptosystem based on genus-2 hyperelliptic curves over prime fields. We show how to reduce the computational complexity for special cases and compare the given cryptosystem with the well-known ECDSA cryptosystem based on elliptic curves.
متن کاملHyperelliptic Curve Cryptography
The use of elliptic-curve groups in cryptography, suggested by Miller [1] and Koblitz [2] three decades ago,provides the same level of security for the Discrete Logarithm Problem as multiplicative groups, with much smallerkey sizes and parameters. The idea was refined two years later by Koblitz, who worked with the group formed bythe points of the Jacobian of hyperelliptic curve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 36 شماره
صفحات -
تاریخ انتشار 2005